Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

计算机网络级联失效建模与分析

针对以往级联失效模型负载局部重分配规则与现实计算机网络全局路由特点不吻合的缺陷,模拟网络中信息流传输过程。定义路由器的失效条件,建立基于负载全局重分配的级联失效模型,并在此基础上提出基于连通和性能两方面的级联失效影响评价参数,进而分析用户流量和攻击方式对计算机网络级联失效的影响。结果表明,随着流量的增大,级联失效存在相变行为,相变点刻画了网络在不会发生级联失效前提下的最大传输能力。此外,针对网络中高度节点的攻击,更为容易引发大规模的级联失效,应予以重点保护。     

基于AdaBoost-SVM的P2P流量识别方法

针对传统的P2P流量识别技术存在识别率低和误判率高的缺点,将机器学习中Ada Boost算法的良好分类能力和SVM的泛化能力结合起来,提出一种基于Ada Boost-SVM组合算法的P2P网络流量识别模型,将SVM作为Ada Boost的基分类器,运用最小近邻法计算支持向量与训练集的样本间的距离实现分类进行P2P流量识别。最后,以4种P2P流量数据为研究对象在MATLAB上进行仿真,仿真结果表明,提出的Ada Boost-SVM的组合算法在P2P网络流量的分类性能和分类准确率上都优于单纯的Ada Boost和SVM,组合算法的P2P流量平均识别率高达98.7%,远高于Ada Boost和SVM的识别率。     

学前儿童交通安全教育的价值探析

对学前儿童进行交通安全教育的直接目的是减少交通事故，保护其生命和身体，同时还具有重要的教育价值。基于教育价值的两个方面即教育的个人价值和社会价值，学前儿童交通安全教育的价值主要体现在对学前儿童的发展价值和以学前儿童为中心扩散开来的延伸价值。发展价值是指交通安全教育促进学前儿童的认知、动作、情意等方面的发展。延伸价值是指学前儿童获得的交通安全知识与意识、规则与行为、尊重与利他等对其成为合格的社会公民是一种自然而然的准备，同时在生态系统理论之下以儿童为中心扩散开来的重要他人、社会相关机构和行业等都会发生相应的改变，将最终有利于社会的进步。     

Optimization and mediated bartering models for ground delay programs

The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

运送有毒物泄漏造成水体污染的扩散模型及求解方法研究

运送有毒物发生交通事故,导致有毒物泄漏引发水体污染,会造成严重影响。在分析污染事故的特点、危害的基础上,根据水力学及污染物的迁移转化规律,建立了有毒物泄漏水体后的转移弥散模型,即将控制水流的圣维南方程和描述有毒物迁移的对流弥散方程进行耦合。运用低数值耗散的半离散中心迎风格式求解方程,其结果可以预测污染河段长度和延续时间。最后,通过实例进行了模拟计算。     

Steady-state analysis of load balancing with Coxian-2 distributed service times

This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N^?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(N^α log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method.     

ATM网中VBR MPEG视频源的RAR(1)模型

对MPEG视频源中一个典型的实际数据序列———星球大战电影序列进行分类、统计分析 ,建立了一个新的RAR ( 1)模型。拟合效果表明 ,RAR ( 1)模型的输出轨迹 ,其形状与实际数据十分形似 ,能够包括场景改变时的大量尖峰。拟合后的RAR ( 1)模型的自相关与实际数据的自相关十分匹配。平稳概率分布接近Gamma分布 ,与实际视频数据的分布一致     

一种基于HLA分布式仿真系统的动态负载平衡算法

基于兴趣域的"快递式"动态负载平衡算法从HLA/RTI提供的服务出发,当节点成为重载节点时,将节点部分负载转移到兴趣域内的轻载节点上,同时采用两次"握手"方式解决了负载迁移过程中出现的问题.通过使用两个评价参数--CPU占有率和内存使用率进行实验证明,负载平衡前后重载节点的CPU利用率和内存使用率有明显差别,结果表明该方法能有效地平衡系统各节点之间的负载,保证系统的实时性,提高系统的服务质量.